Pomset mcfgs
نویسنده
چکیده
This paper identifies two orthogonal dimensions of context sensitivity, the first being context sensitivity in concurrency and the second being structural context sensitivity. We present an example from natural language which seems to require both types of context sensitivity, and introduce partially ordered multisets (pomsets) mcfgs as a formalism which succintly expresses both.
منابع مشابه
Multiple Context Free Grammars
Multiple context-free grammars (MCFGs) are a generalization of context-free grammars that deals with tuples of strings. This is a brief survey of MCFGs, their properties, and their relations to other formalisms. We outline simple constructions to convert MCFGs to Hyperedge Replacement Grammars (HRGs) and to Deterministic Tree Walking Transducers (DTWTs), and also to simulate DTWTs by MCFGs. We ...
متن کاملWell-Nestedness Properly Subsumes Strict Derivational Minimalism
Minimalist grammars (MGs) constitute a mildly contextsensitive formalism when being equipped with a particular locality condition (LC), the shortest move condition. In this format MGs define the same class of derivable string languages as multiple context-free grammars (MCFGs). Adding another LC to MGs, the specifier island condition (SPIC), results in a proper subclass of derivable languages. ...
متن کاملOn noncommutative extensions of linear logic
In the seminal work [12] Retoré introduced Pomset logic, an extension of linear logic with a self-dual noncommutative connective. Pomset logic is defined by means of proof-nets, later a deep inference system BV [8] was designed for this extension, but equivalence of system has not been proven up to now. As for a sequent calculus formulation, it has not been known for either of these logics, and...
متن کاملEvent Correlation with Boxed Pomsets
This paper proposes a diagnosis framework for distributed systems based on pomset languages. Diagnosis is performed by projecting these models on a collection of observable labels and then synchronization with an observation. This paper first proposes a new model called boxed pomset languages, which extends classical pomset-based languages as so called High-level Message Sequence Charts. It can...
متن کاملRecognizability of Pomset Languages with Event Reenement
In the present paper, we contribute to the theory of recognizable pom-set (or partial word) languages from an algebraic point of view. By substitutions in pomsets labelled with variables and pomset contexts, we deene the syntactic equivalence of a pomset language, and use nite index ones to deene recognizable languages. We show that the induced recognizable pomset languages have extended closur...
متن کامل